|
Taxonomy of congestion control refers to grouping TCP congestion avoidance algorithms according to their characteristics. ==Example classification== The following is one possible classification according to the following properties: #The type and amount of feedback received from the network: Loss (L); delay (D); single-bit (S) or multi-bit (M) explicit signals #Incremental deployability on the current Internet: Sender needs modification (S); receiver needs modification (R); routers/gateways need modification (G) #The aspect of performance it aims to improve: high bandwidth-delay product networks (B); lossy links (L); fairness (F); advantage to short flows (S); variable-rate links (V); speed of convergence (C) #The fairness criterion it uses: max-min (M), proportional (P), "minimum potential delay" (D), Other (O) Some well-known congestion avoidance mechanisms are classified by this scheme as follows: 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Taxonomy of congestion control」の詳細全文を読む スポンサード リンク
|